Logical modelling of constraints on acceptable syntactic tree forms for natural language analysis
نویسنده
چکیده
In this paper, we present a modelling of tree filtering mechanisms in logical-based grammars. This filtering permits restriction of the excessive generative capacity of syntactic parsing grammars. In order to preserve the declarative aspect of natural language grammars, we consider syntactic parsing as a deduction process; tree filtering consists in the reduction of the allowed forms of the proof tree corresponding to the derivation process of a sentence. We also evoke a computational implementation in the framework of the Government and Binding theory.
منابع مشابه
Using syntactic information in handling natural language queries forextended boolean retrieval model
There are considerable evidences that trained users can achieve a good search eeectiveness through structured boolean queries rather than simple keyword queries because boolean operators can help to make more accurate representations of users' information search needs. However, it is not normally easy for ordinary users to construct eeective boolean queries using appropriate boolean operators. ...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملTransforming Dependency Structures to Logical Forms for Semantic Parsing
The strongly typed syntax of grammar formalisms such as CCG, TAG, LFG and HPSG offers a synchronous framework for deriving syntactic structures and semantic logical forms. In contrast—partly due to the lack of a strong type system—dependency structures are easy to annotate and have become a widely used form of syntactic analysis for many languages. However, the lack of a type system makes a for...
متن کاملTTT: A Tree Transduction Language for Syntactic and Semantic Processing
In this paper we present the tree to tree transduction language, TTT. We motivate the overall ”template-to-template” approach to the design of the language, and outline its constructs, also providing some examples. We then show that TTT allows transparent formalization of rules for parse tree refinement and correction, logical form refinement and predicate disambiguation, inference, and verbali...
متن کاملSecPAL: Design and semantics of a decentralized authorization language
We present a declarative authorization language. Policies and credentials are expressed using predicates defined by logical clauses, in the style of constraint logic programming. Access requests are mapped to logical authorization queries, consisting of predicates and constraints combined by conjunctions, disjunctions, and negations. Access is granted if the query succeeds against the current d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990